Escaping Local Minima via Appraisal Driven Responses
نویسندگان
چکیده
Inspired by the reflective and deliberative control mechanisms used in cognitive architectures such as SOAR Sigma, we propose an alternative decision mechanism driven architectural appraisals allowing robots to overcome impasses. The presented work builds on improves our previous a generally applicable with roots Standard Model of Mind Generalized Cognitive Hour-glass Model. proposed provides automatic context-dependent switching between exploration-oriented, goal-oriented, backtracking behavior, robot A simulation study two applications utilizing is demonstrating applicability mechanism.
منابع مشابه
Escaping Local Minima in Logic Synthesis
In this report, we continue studying Logic Synthesis Preserving Specification (LSPS). Given a combinational circuit N and its partition into subcircuits N1,..,Nk (this partition is called a specification of N), LSPS optimizes N by replacing each subcircuit Ni with toggle equivalent subcircuit Ni. As we showed before, LSPS is scalable. In this report, we demonstrate that LSPS can be also viewed ...
متن کاملEscaping free-energy minima.
We introduce a powerful method for exploring the properties of the multidimensional free energy surfaces (FESs) of complex many-body systems by means of coarse-grained non-Markovian dynamics in the space defined by a few collective coordinates. A characteristic feature of these dynamics is the presence of a history-dependent potential term that, in time, fills the minima in the FES, allowing th...
متن کاملEscaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions
We consider the problem of optimizing an approximately convex function over a bounded convex set in Rn using only function evaluations. The problem is reduced to sampling from an approximately log-concave distribution using the Hit-and-Run method, which is shown to have the same O∗ complexity as sampling from log-concave distributions. In addition to extend the analysis for log-concave distribu...
متن کاملEscaping Local Optima via Parallelization and Migration
We present a new nature-inspired algorithm, mt − GA, which is a parallelized version of a simple GA, where subpopulations evolve independently from each other and on different threads. The overall goal is to develop a population-based algorithm capable to escape from local optima. In doing so, we used complex trap functions, and we provide experimental answers to some crucial implementation dec...
متن کاملNeon2: Finding Local Minima via First-Order Oracles
We propose a reduction for non-convex optimization that can (1) turn an stationary-point finding algorithm into an local-minimum finding one, and (2) replace the Hessian-vector product computations with only gradient computations. It works both in the stochastic and the deterministic settings, without hurting the algorithm’s performance. As applications, our reduction turns Natasha2 into a firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics
سال: 2022
ISSN: ['2218-6581']
DOI: https://doi.org/10.3390/robotics11060153